Does the Sum Rule Hold at the Big Bang?
نویسنده
چکیده
In Dice 2010 Sumati Surya brought up a weaker Quantum sum rule as a biproduct of a quantum invariant measure space. Our question is stated as follows: Does it make sense to have disjointed sets to give us quantum conditions for a measure at the origin of the big bang? We argue that the answer is no, which has implications as to quantum measures and causal set structure. What is called equation (1) in the text requires a length, and interval, none of which holds at a point in space-time.singularity. What are the reasons? First, measurable spaces allow disjoint sets. Also, that smooth relations alone do not define separability or admit sets Planck’s length, if it exists, is a natural way to get about the ‘bad effects’ of a cosmic singularity at the beginning of space-time evolution, but if a new development is to believed, namely by Stoica in the article, about removing the cosmic singularity as a break down point in relativity, there is nothing which forbids space-time from collapsing to a point. If that happens, the cautions as to no disjoint intervals at a point raise the questions as to the appropriateness of Surya’s quantum measure. Since Stoica’s re scaling of pressure and density involve the cube of the scale factor, a, the differentiability and smoothness issues of the Friedman and acceleration equation vanish, leading to problems with the Hausdorf limiting cases for disjoint open sets, which makes quantum vector meaures not feasibile, due to vanishing of disjoint sets, as we approach a point in space-time. The final conclusion is that the intial singularity has to be embedded into higher dimensions, as in String theory due to 4 dimensional problems with quatum measures which in themselves in four dimensions break down.
منابع مشابه
STRUCTURAL OPTIMIZATION USING BIG BANG-BIG CRUNCH ALGORITHM: A REVIEW
The big bang-big crunch (BB-BC) algorithm is a popular metaheuristic optimization technique proposed based on one of the theories for the evolution of the universe. The algorithm utilizes a two-phase search mechanism: big-bang phase and big-crunch phase. In the big-bang phase the concept of energy dissipation is considered to produce disorder and randomness in the candidate population while in ...
متن کاملCONSTRAINED BIG BANG-BIG CRUNCH ALGORITHM FOR OPTIMAL SOLUTION OF LARGE SCALE RESERVOIR OPERATION PROBLEM
A constrained version of the Big Bang-Big Crunch algorithm for the efficient solution of the optimal reservoir operation problems is proposed in this paper. Big Bang-Big Crunch (BB-BC) algorithm is a new meta-heuristic population-based algorithm that relies on one of the theories of the evolution of universe namely, the Big Bang and Big Crunch theory. An improved formulation of the algorithm na...
متن کاملBIG BANG – BIG CRUNCH ALGORITHM FOR LEAST-COST DESIGN OF WATER DISTRIBUTION SYSTEMS
The Big Bang-Big Crunch (BB–BC) method is a relatively new meta-heuristic algorithm which inspired by one of the theories of the evolution of universe. In the BB–BC optimization algorithm, firstly random points are produced in the Big Bang phase then these points are shrunk to a single representative point via a center of mass or minimal cost approach in the Big Crunch phase. In this paper, the...
متن کاملEstimation of parameters of metal-oxide surge arrester models using Big Bang-Big Crunch and Hybrid Big Bang-Big Crunch algorithms
Metal oxide surge arrester accurate modeling and its parameter identification are very important for insulation coordination studies, arrester allocation and system reliability. Since quality and reliability of lightning performance studies can be improved with the more efficient representation of the arresters´ dynamic behavior. In this paper, Big Bang – Big Crunch and Hybrid Big Bang – Big Cr...
متن کاملEVALUATING EFFICIENCY OF BIG-BANG BIG-CRUNCH ALGORITHM IN BENCHMARK ENGINEERING OPTIMIZATION PROBLEMS
Engineering optimization needs easy-to-use and efficient optimization tools that can be employed for practical purposes. In this context, stochastic search techniques have good reputation and wide acceptability as being powerful tools for solving complex engineering optimization problems. However, increased complexity of some metaheuristic algorithms sometimes makes it difficult for engineers t...
متن کامل